The Hidden Root Problem
نویسنده
چکیده
In this paper we study a novel computational problem called the Hidden Root Problem, which appears naturally when considering fault attacks on pairing based cryptosystems. Furthermore, a variant of this problem is one of the main obstacles for efficient pairing inversion. We present an algorithm to solve this problem over extension fields and investigate for which parameters the algorithm becomes practical. 1
منابع مشابه
The Relationship between Hidden Curriculum Components and Student Professional Adaptability at Tabriz University of Medical Sciences
Introduction: Hidden curriculum is one of the concepts and topics discussed in the field of curriculum. It has been much considered in education research, but its impacts on the field of higher education have not been seriously taken into account. Therefore, the present study aimed to investigate the role of hidden curriculum components in the professional adaptability of students at Tabriz U...
متن کاملEvaluation of the position of mandibular third molar hidden teeth and its effect on second adjacent molar teeth in panoramic radiography in patients referring to Birjand Dental School in 2018-19
Background and Aim: The third molar tooth lies with symptoms such as periodontal problems, caries, crowding, root resorption, cyst and tumor formation of the adjacent second molar. The purpose of this study was performed to evaluation of the position of mandibular third molar teeth and its effect on second adjacent molar teeth. Materials and Methods: Panoramic radiography were obtained from 26...
متن کاملFinding Small Solutions of a Class of Simultaneous Modular Equations and Applications to Modular Inversion Hidden Number Problem and Inversive Congruential Generator
In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number generator and consider how to more efficiently attack them in terms of fewer samples or outputs. We reduce the attacking problem to finding small solutions of systems of modular polynomial equations of the form ai+bix0+cixi+x0xi = 0 (mod p), and present two strategies to cons...
متن کاملHidden threats inducing medical errors in Tehran public hospitals
Introduction: Medical errors represent a serious public health problem and pose a threat to patient safety. This study aimed to determine the hidden threats in the incidence of medical errors at public hospitals in Tehran. Methods: In this descriptive study, the population included all process owners (12-person teams) in public hospitals of Tehran. The sample size was 396 individuals, sel...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کامل